A modification of the generalized shift-splitting method for singular saddle point problems
نویسندگان
چکیده
A modification of the generalized shift-splitting (GSS) method is presented for solving singular saddle point problems. In this kind of modification, the diagonal shift matrix is replaced by a block diagonal matrix which is symmetric positive definite. Semiconvergence of the proposed method is investigated. The induced preconditioner is applied to the saddle point problem and the preconditioned system is solved by the restarted generalized minimal residual method. Eigenvalue distribution of the preconditioned matrix is also discussed. Finally some numerical experiments are given to show the effectiveness and robustness of the new preconditioner. Numerical results show that the modified GSS method is superior to the classical GSS method.
منابع مشابه
Generalized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملOn the generalized shift-splitting preconditioner for saddle point problems
In this paper, the generalized shift-splitting preconditioner is implemented for saddle point problems with symmetric positive definite (1,1)-block and symmetric positive semidefinite (2,2)-block. The proposed preconditioner is extracted form a stationary iterative method which is unconditionally convergent. Moreover, a relaxed version of the proposed preconditioner is presented and some proper...
متن کاملA Generalization of Local Symmetric and Skew-symmetric Splitting Iteration Methods for Generalized Saddle Point Problems
In this paper, we further investigate the local Hermitian and skew-Hermitian splitting (LHSS) iteration method and the modified LHSS (MLHSS) iteration method for solving generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. When A is non-symmetric positive definite, the convergence conditions are obtained, which generalize some results of Jiang and Cao [M.-Q. Jiang and Y. Ca...
متن کاملSemi-convergence of the Generalized Local Hss Method for Singular Saddle Point Problems
Recently, Zhu [Appl. Math. Comput., 218 (2012), 8816–8824] considered the generalized local HSS (GLHSS) method for solving nonsingular saddle point problems and studied its convergence. In this paper, we prove the semi-convergence of the GLHSS method when it is applied to solve the singular saddle point problems.
متن کاملSemi-convergence Analysis of the Inexact Uzawa Method for Singular Saddle Point Problems
Recently, various Uzawa methods were proposed based on different matrix splitting for solving nonsingular saddle point problems, and the necessary and sufficient condition of the convergence for those Uzawa methods were derived. Motivated by their results, in this paper we give the semi-convergence analysis of the inexact Uzawa method which is applied to solve singular saddle point problems und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Mathematics with Applications
دوره 74 شماره
صفحات -
تاریخ انتشار 2017